Lecture @ MPRI Paris Master of Computer Science (Université Paris Diderot) by Nicolas Schabanel<br />Feb 2, 2011 - 16:15-19:15 - Exhaustive Sampling<br />• A constant time (1+ε)-approximation for the size of a maximal matching in constant maximum degree graphs<br />• Exhaustive guessing 1: a polynomial time randomized (1+ε)-approximation (PTRAS) for Max-CUT in dense graphs
